Sander Mikelsaar Supervised by Vitaly Skachek
نویسندگان
چکیده
DNA storage is an emerging technology that could be used for long-term data storage due to its massive storage capacity and longevity. In this report firstly, we cover the background of DNA storage in general, including the limits set by the current state of technology regarding the synthesis and sequencing of DNA. Secondly, we cover the fundamental limits and tradeoffs of DNA storage under a simple theoretical model, considering current technological constraints. Finally, we show that the model constructed in [1] is sufficient for achieving optimal storage and recovery of the data stored on DNA.
منابع مشابه
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial
متن کاملCollusion-Secure Fingerpinting for Digital Data
This is the report based on the paper [BS98]. This report introduces fingerprinting for digital data and problem of collusion, and then presents results obtained in the paper. Some possible ideas for further research are discussed at the end.
متن کاملcient Encoding Algorithm for Third Order Spectral Null Codes
An e cient algorithm is presented for encoding unconstrained information se quences into a third order spectral null code of length n and redundancy log n O log logn The encoding can be implemented using O n integer additions and O n logn counter increments
متن کاملEfficient Encoding Algorithm for Third-Order Spectral-Null Codes
An efficient algorithm is presented for encoding unconstrained information sequences into a third-order spectral-null code of length n and redundancy 9 log 2 n + O(log logn). The encoding can be implemented using O(n) integer additions and O(n logn) counter increments.
متن کامل